On Bisimulations for the Spi Calculus
نویسندگان
چکیده
The spi calculus is an extension of the pi calculus with cryptographic primitives, designed for the verification of cryptographic protocols. Due to the extension, the naive adaptation of labeled bisimulations for the pi calculus is too strong to be useful for the purpose of verification. Instead, as a viable alternative, several “environment-sensitive” bisimulations have been proposed. In this paper we formally study the differences between these bisimulations.
منابع مشابه
Spi Calculus Translated to π-Calculus Preserving May-Testing
We present a concise and natural encoding of the spicalculus into the more basic π-calculus and establish its correctness with respect to a formal notion of testing. This is particularly relevant for security protocols modelled in spi since the tests can be viewed as adversaries. The translation has been implemented in a prototype tool. As a consequence, protocols can be described in the spi ca...
متن کاملSpi Calculus Translated to ?--Calculus Preserving May-Tests
We present a concise and natural encoding of the spicalculus into the more basic π-calculus and establish its correctness with respect to a formal notion of testing. This is particularly relevant for security protocols modelled in spi since the tests can be viewed as adversaries. The translation has been implemented in a prototype tool. As a consequence, protocols can be described in the spi ca...
متن کاملEquivalEncEs and calculi for formal vErification of cryptographic protocols
Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptographic primitives are flawless, facilitates the construction of formal models and verification tools. Such models are often based on process cal...
متن کاملSymbolic Bisimulation in the Spi Calculus
The spi calculus is an executable model for the description and analysis of cryptographic protocols. Security objectives like secrecy and authenticity can be formulated as equations between spi calculus terms, where equality is interpreted as a contextual equivalence. One problem with verifying contextual equivalences for message-passing process calculi is the infinite branching on process inpu...
متن کاملComputing strong and weak bisimulations for psi-calculi
We present a symbolic transition system and strong and weak bisimulationequivalences for psi-calculi, and show that they are fully abstract with respectto bisimulation congruences in the non-symbolic semantics. An algorithmwhich computes the most general constraint under which two agents arebisimilar is developed and proved correct.A psi-calculus is an extension of the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 15 شماره
صفحات -
تاریخ انتشار 2002